Wait-Free Snapshots in Real-Time Systems: Algorithms and Performance
نویسندگان
چکیده
Snap-shot mechanisms are used to read a globally consistent set of variable values. Such a mechanism can be used to solve a variety of communication and synchronization problems, including system monitoring and control of real-time applications. Methods based on locking (e.g. using semaphores) are penalized by blocking, which typically leads to difficulties in guaranteeing deadlines of high priority tasks. Lock-free methods, which take a snap-shot and then check if it corresponds to a consistent system state, have unpredictable timing-behavior, since they may have to retry an unpredictable number of times. Clearly, a method which combines the predictability of locking-based methods with the low interference (no blocking) of lock-free methods is desirable. In this paper we present one such method, based and the concept of wait-freeness. A wait-free method is a lockfree method which is guaranteed to correctly complete in a bounded number of steps. The price to pay for this predictability in the timing domain is the need for more than one copy of the shared objects. In addition to proving our method correct, we evaluate it analytically by formulating and comparing schedulability equations for snapshots in systems using lock-based, lock-free, and our wait-free method. We also outline ideas to study the effects of using the different snapshot methods in distributed (CAN-based) systems. Our evaluations indicate that our method is an efficient and safe alternative to traditional lock-based and lock-free methods. This work is performed within the Advanced Software Technology (ASTEC) competence center, supported by the Swedish board for technical development (NUTEK) Partially supported by a grant of the Swedish Research Council for Engineering Sciences (TFR) zPart of this work has been done while this author has been a visiting researcher at the Real-Time Systems Group, Department of Computer Systems (DOCS), Uppsala University, Sweden
منابع مشابه
Thesis for the Degree of Licentiate of Philosophy Applications of Non-Blocking Data Structures to Real-Time Systems
This thesis is a major part of the results within a project called ”Applications of wait/lock-free protocols to real-time systems”. This project is funded by the national Swedish Real-Time Systems research initiative ARTES (www.artes.uu.se) supported by the Swedish Foundation for Strategic Research. The project started in March 1999 and has been running in major with one active Ph.D. student. T...
متن کاملSimple Wait-Free Snapshots for Real-Time Systems with Sporadic Tasks1
A wait-free algorithm for implementing a snapshot mechanism for real-time systems is presented in this paper. Snapshot mechanisms give the means to a real-time task to read a globally consistent set of variable values while other concurrent tasks are updating them. Such a mechanism can be used to solve a variety of communication and synchronisation problems, including system monitoring and cont...
متن کاملSimple and Fast Wait-free Snapshots for Real-time Systems
A wait-free algorithm for implementing a snapshot mechanism for real-time systems is presented in this paper. Snapshot mechanisms give the means to real-time task to read a globally consistent set of variable values while other concurrent tasks are updating them. Such a mechanism can be used to solve a variety of communication and synchronisation problems, including system monitoring and contro...
متن کاملImproving Wait-Free Algorithms for Interprocess Communication in Embedded Real-Time Systems
Concurrency management is a basic requirement for interprocess communication in any multitasking system. This usually takes the form of lock-based or other blocking algorithms. In real-time and/or time-sensitive systems, the less-predictable timing behavior of lock-based mechanisms and the additional task-execution dependency make synchronization undesirable. Recent research has provided non-bl...
متن کاملOn Utility Accrual Processor Scheduling with Wait-Free Synchronization for Embedded Real-Time Software
We present the first wait-free utility accrual (UA) real-time scheduling algorithms for embedded real-time systems. UA scheduling algorithms allow application activities to be subject to time/utility function (TUF) time constraints, and optimize criteria such as maximizing the sum of the activities’ attained utilities. We present UA algorithms that use wait-free synchronization for mutually exc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998